An Unsharp Logic from Quantum Computation
نویسندگان
چکیده
Logical gates studied in quantum computation suggest a natural logical abstraction that gives rise to a new form of unsharp quantum logic. We study the logical connectives corresponding to the following gates: the Toffoli gate, the NOT and the √ NOT (which admit of natural physical models). This leads to a semantic characterization of a logic that we call computational quantum logic (CQL).
منابع مشابه
Automata theory based on unsharp quantum logic
By studying two unsharp quantum structures, namely extended lattice ordered effect algebras and lattice ordered QMV algebras, we obtain some characteristic theorems of MV algebras. We go on to discuss automata theory based on these two unsharp quantum structures. In particular, we prove that an extended lattice ordered effect algebra (or a lattice ordered QMV algebra) is an MV algebra if and on...
متن کاملRemarks on unsharp quantum observables, objectification, and modal interpretations
In this contribution I wish to pose a question that emerged from discussions with Dennis Dieks regarding my talk at the Utrecht Workshop. The question is whether a variant of a modal interpretation is conceivable that could accommodate property ascriptions associated with nonorthogonal resolutions of the unity and nonorthogonal families of relative states as they occur in imperfect or genuinely...
متن کاملThe computing power of Turing machine based on quantum logic
Super-Turing computational power has been invoked by models of computation that make use of new physical principles or of different underlying logic of computation. Recently, it has been observed that Turing machines based on quantum logic can solve undecidable problems. In this paper we will give recursion-theoretical characterization of the computational power of this kind of quantum Turing m...
متن کاملTuring machines based on unsharp quantum logic
In this paper, we consider Turing machines based on unsharp quantum logic. For a lattice-ordered quantum multiple-valued (MV) algebra E , we introduce E -valued non-deterministic Turing machines (E NTMs) and E -valued deterministic Turing machines (E DTMs). We discuss different E valued recursively enumerable languages from width-first and depth-first recognition. We find that width-first recog...
متن کاملEfficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits
Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...
متن کامل